Finding the median under IOI condition
نویسندگان
چکیده
منابع مشابه
Finding the Median under IOI Conditions
We explain the ingredients of the International Olympiad in Informatics (IOI), which is a challenging competition for high-school students focusing on algorithmic problem solving. We treat in detail the MEDIAN task, which the authors created for IOI 2000: Given an odd number of objects, all of distinct strength, develop an efficient algorithm to determine the object of median strength, using as...
متن کاملRandomized Median Finding and Quicksort
For some computational problems (like sorting), even though the input is given and known (deterministic), it might be helpful to use randomness (probabilitic processes) in the design of the algorithm. This is analogous to the probabilistic method in which we were using probability to prove the existence of a certain object. We’ll see several examples of randomized algorithms in this course, one...
متن کاملFinding the Median (Obliviously) with Bounded Space
We prove that any oblivious algorithm using space S to find the median of a list of n integers from {1, . . . , 2n} requires time Ω(n log logS n). This bound also applies to the problem of determining whether the median is odd or even. It is nearly optimal since Chan, following Munro and Raman, has shown that there is a (randomized) selection algorithm using only s registers, each of which can ...
متن کاملFinding the median of three permutations under the Kendall-tau distance
Given m permutations π, π . . . π of {1, 2, . . . , n} and a distance function d, the median problem is to find a permutation π that is the ”closest” of the m given permutations. More formally, we want to find π such that, for all π ∈ Sn, ∑m i=1 d(π , π) ≤ ∑m i=1 d(π, π ). (ICI, BIBLIO DE CE QUI A ETE FAIT) In this article, we choose to study the problem under the Kendall-Tau distance, denoted ...
متن کاملFinding the median of three permutations under the Kendall-τ distance - Extended Abstract
Given m permutations π, π . . . π of {1, 2, . . . , n} and a distance function d, the median problem is to find a permutation π∗ that is the ”closest” of the m given permutations. Here, we study the problem under the Kendall-τ distance that counts the number of pairwise disagreements between permutations. This problem is also known, in the context of rank aggregation, as the Kemeny Score Proble...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Informatics in Education
سال: 2002
ISSN: 1648-5831,2335-8971
DOI: 10.15388/infedu.2002.06